New duality results for evenly convex optimization problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

متن کامل

Duality for almost convex optimization problems via the perturbation approach

We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from the convex analysis are extended to the case of almost convex sets and functions. The duality for some classes of primal-dual problems is derived as a special case of the general approach. The sufficient regularity conditions we ...

متن کامل

An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...

متن کامل

New Constraint Qualification and Conjugate Duality for Composed Convex Optimization Problems

We present a new constraint qualification which guarantees strong duality between a cone-constrained convex optimization problem and its Fenchel-Lagrange dual. This result is applied to a convex optimization problem having, for a given nonempty convex cone K , as objective function a K-convex function postcomposed with a K-increasing convex function. For this so-called composed convex optimizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization

سال: 2020

ISSN: 0233-1934,1029-4945

DOI: 10.1080/02331934.2020.1756287